Log-optimal (
نویسندگان
چکیده
We enumerate and classify all stationary logarithmic configurations of d + 2 d+2 points on the unit sphere in alttext="d"> encoding="application/x-tex">d –dimensions. In particular, we show that energy attains its local minima at consist two orthogonal to each other regular simplexes cardinality alttext="m"> m encoding="application/x-tex">m alttext="n"> n encoding="application/x-tex">n . The global minimum occurs when alttext="m equals n"> = encoding="application/x-tex">m=n if is even n 1"> 1 encoding="application/x-tex">m=n+1 otherwise. This characterizes a new class minimize alttext="double-struck upper S Superscript d minus S − encoding="application/x-tex">\mathbb {S}^{d-1} for classes known literature, simplex (d+1 ) cross-polytope alttext="2 d"> encoding="application/x-tex">2d ), are both universally optimal configurations.
منابع مشابه
Convex Hull with Optimal Query Time and O ( log n · log log n ) Update Time
The dynamic maintenance of the convex hull of a set of points in the plane is one of the most important problems in computational geometry. We present a data structure supporting point insertions in amortized O(log n · log log logn) time, point deletions in amortized O(log n · log logn) time, and various queries about the convex hull in optimal O(log n) worst-case time. The data structure requi...
متن کاملEmpirical log-optimal portfolio selections: a survey∗
In this paper the static portfolio and the dynamic log-optimal portfolio for memoryless and for stationary market processes are studied. We illustrate their performance (average annual yield) for NYSE data. 1 Notations Consider a market consisting of d assets. The evolution of the market in time is represented by a sequence of price vectors s1, s2, . . . ∈ R+, where sn = (s (1) n , . . . , s (d...
متن کاملLog(λ) Modifications for Optimal Parallelism
It is usually considered that evolutionary algorithms are highly parallel. In fact, the theoretical speed-ups for parallel optimization are far better than empirical results; this suggests that evolutionary algorithms, for large numbers of processors, are not so efficient. In this paper, we show that in many cases automatic parallelization provably provides better results than the standard para...
متن کاملLog(λ) Corrections for Optimal Parallelism
It is usually considered that evolutionary algorithms are highly parallel. In fact, the theoretical speed-ups for parallel optimization are far better than empirical results; this suggests that evolutionary algorithms, for large numbers of processors, are not so efficient. In this paper, we show that in many cases automatic parallelization provably provides better results than the standard para...
متن کاملExchangeable Optimal Transportation and Log-concavity
We study the Monge and Kantorovich transportation problems on R∞ within the class of exchangeable measures. With the help of the de Finetti decomposition theorem the problem is reduced to an unconstrained optimal transportation problem on a Hilbert space. We find sufficient conditions for convergence of finite-dimensional approximations to the Monge solution. The result holds, in particular, un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2023
ISSN: ['2330-0000']
DOI: https://doi.org/10.1090/btran/118